package a10_动态规划;

/**
 * <p>
 * a04_使用最小花费爬楼梯复习3
 * </p>
 *
 * @author flyduck
 * @since 2025/3/20
 */
public class a04_使用最小花费爬楼梯复习3 {
    //dp[i]：表示爬到第i个台阶的最小花费

    //递推公式：
    //从i-1爬上来：dp[i-1] + cost[i-1]
    //从i-2爬上来：dp[i-2] + cost[i-2]

    //初始化：dp[0] = 0   dp[1] = 0
    public int minCostClimbingStairs(int[] cost) {
        int[] dp = new int[cost.length+1];
        dp[0] = 0;
        dp[1] = 0;
        for (int i = 2; i <= cost.length; i++) {
            dp[i] = Math.min(dp[i-1] + cost[i-1], dp[i-2] + cost[i-2]);
        }

        return dp[cost.length];
    }
}
